Papers with Search applications
Query-focused Sentence Compression in Linear Time (D19-1)
Copied to clipboard
| Challenge: | Existing techniques for constrained compression are slow and require third-party solvers. |
| Approach: | They propose a query-focused sentence compression technique which constructs length and lexically constrained compressions in linear time by growing a subgraph in the dependency parse of a sentence. |
| Outcome: | The proposed technique achieves an 11x empirical speedup over baseline methods while improving query-focused applications. |